Panther: Fast Top-k Similarity Search in Large Networks
نویسندگان
چکیده
Jing Zhang†, Jie Tang†], Cong Ma†, Hanghang Tong‡, Yu Jing†, and Juanzi Li† †Department of Computer Science and Technology, Tsinghua University Tsinghua National Laboratory for Information Science and Technology (TNList) ‡School of Computing, Informatics, and Decision Systems Engineering, ASU {zhangjing12, ma-c11}@mails.tsinghua.edu.cn, {jietang, yujing5b5d,lijuanzi}@tsinghua.edu.cn, [email protected]
منابع مشابه
Reverse Top-k Search using Random Walk with Restart
With the increasing popularity of social networks, large volumes of graph data are becoming available. Large graphs are also derived by structure extraction from relational, text, or scientific data (e.g., relational tuple networks, citation graphs, ontology networks, protein-protein interaction graphs). Node-to-node proximity is the key building block for many graph-based applications that sea...
متن کاملPathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks
Similarity search is a primitive operation in database and Web search engines. With the advent of large-scale heterogeneous information networks that consist of multi-typed, interconnected objects, such as the bibliographic networks and social media networks, it is important to study similarity search in such networks. Intuitively, two objects are similar if they are linked by many paths in the...
متن کاملFast Nearest Neighbors in Large and Composite Networks
We address the problem of k Nearest Neighbor (kNN) search in networks using a random walk based proximity measure. Our approach retrieves the exact top neighbors at query time without relying on off-line indexing or summaries of the entire network. This makes it suitable for very large networks, as well as for composite network overlays mixed at query time. We provide scalability and flexibilit...
متن کاملDiversified Top-k Similarity Search in Large Attributed Networks
Given a large network and a query node, finding its top-k similar nodes is a primitive operation in many graphbased applications. Recently enhancing search results with diversification have received much attention. In this paper, we explore an novel problem of searching for top-k diversified similar nodes in attributed networks, with the motivation that modeling diversification in an attributed...
متن کاملScalable Nearest Neighbors with Guarantees in Large and Composite Networks
We address the problem of k Nearest Neighbor (kNN) search in networks, according to a random walk proximity measure called Effective Importance. Our approach retrieves the exact top neighbors at query time without relying on off-line indexing or summaries of the entire network. This makes it suitable for very large dynamic networks, as well as for composite network overlays mixed at query time....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1504.02577 شماره
صفحات -
تاریخ انتشار 2015